0.00/0.00	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : supatvars_int
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --sup-at-vars \
0.00/0.00	  --ho-no-ext-pos \
0.00/0.00	  --ho-no-ext-neg \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n127.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:14:26 CST 2018
0.00/0.21	% done 20 iterations in 0.007s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox2/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(subsetI2, axiom,
0.00/0.21	  (subsetI2 <=> (![A,B]: ((![Xx]: (in(Xx,A) => in(Xx,B))) => subset(A,B))))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X5, X6]: (in(sk_Xx2(X5, X6), X6) | subset(X6, X5) | ~ subsetI2),
0.00/0.21	    inference('cnf', [status(esa)], [subsetI2])).
0.00/0.21	tff(setunionsingleton2, conjecture,
0.00/0.21	  (setadjoinIL =>
0.00/0.21	   (setunionI =>
0.00/0.21	    (subsetI2 => (![A]: subset(A,setunion(setadjoin(A,emptyset)))))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (setadjoinIL =>
0.00/0.21	     (setunionI =>
0.00/0.21	      (subsetI2 => (![A]: subset(A,setunion(setadjoin(A,emptyset))))))))).
0.00/0.21	tff('1', plain, subsetI2, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X5, X6]: (in(sk_Xx2(X5, X6), X6) | subset(X6, X5) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain, ![X5, X6]: (subset(X6, X5) | in(sk_Xx2(X5, X6), X6)),
0.00/0.21	    inference('simplify', [status(thm)], ['2'])).
0.00/0.21	tff(setunionI, axiom,
0.00/0.21	  (setunionI <=> (![A,Xx,B]: (in(Xx,B) => (in(B,A) => in(Xx,setunion(A))))))).
0.00/0.21	tff('4', plain,
0.00/0.21	    ![X2, X3, X4]:
0.00/0.21	      (~ in(X2, X3) | ~ in(X4, X2) | in(X4, setunion(X3)) | ~ setunionI),
0.00/0.21	    inference('cnf', [status(esa)], [setunionI])).
0.00/0.21	tff('5', plain, setunionI, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('6', plain,
0.00/0.21	    ![X2, X3, X4]:
0.00/0.21	      (~ in(X2, X3) | ~ in(X4, X2) | in(X4, setunion(X3)) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['4', '5'])).
0.00/0.21	tff('7', plain,
0.00/0.21	    ![X2, X3, X4]: (in(X4, setunion(X3)) | ~ in(X4, X2) | ~ in(X2, X3)),
0.00/0.21	    inference('simplify', [status(thm)], ['6'])).
0.00/0.21	tff('8', plain,
0.00/0.21	    ![X0, X1, X2]:
0.00/0.21	      (~ $true
0.00/0.21	       | subset(X0, X1)
0.00/0.21	       | ~ in(X0, X2)
0.00/0.21	       | in(sk_Xx2(X1, X0), setunion(X2))),
0.00/0.21	    inference('sup-', [status(thm)], ['3', '7'])).
0.00/0.21	tff('9', plain,
0.00/0.21	    ![X0, X1, X2]:
0.00/0.21	      (in(sk_Xx2(X1, X0), setunion(X2)) | ~ in(X0, X2) | subset(X0, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['8'])).
0.00/0.21	tff('10', plain,
0.00/0.21	    ![X5, X6]: (~ in(sk_Xx2(X5, X6), X5) | subset(X6, X5) | ~ subsetI2),
0.00/0.21	    inference('cnf', [status(esa)], [subsetI2])).
0.00/0.21	tff('11', plain,
0.00/0.21	    ![X5, X6]: (~ in(sk_Xx2(X5, X6), X5) | subset(X6, X5) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['10', '1'])).
0.00/0.21	tff('12', plain, ![X5, X6]: (subset(X6, X5) | ~ in(sk_Xx2(X5, X6), X5)),
0.00/0.21	    inference('simplify', [status(thm)], ['11'])).
0.00/0.21	tff('13', plain,
0.00/0.21	    ![X0, X1]:
0.00/0.21	      (~ $true
0.00/0.21	       | subset(X1, setunion(X0))
0.00/0.21	       | ~ in(X1, X0)
0.00/0.21	       | subset(X1, setunion(X0))),
0.00/0.21	    inference('sup-', [status(thm)], ['9', '12'])).
0.00/0.21	tff('14', plain, ![X0, X1]: (~ in(X1, X0) | subset(X1, setunion(X0))),
0.00/0.21	    inference('simplify', [status(thm)], ['13'])).
0.00/0.21	tff('15', plain, ~ subset(sk_A2, setunion(setadjoin(sk_A2, emptyset))),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('16', plain, (~ $true | ~ in(sk_A2, setadjoin(sk_A2, emptyset))),
0.00/0.21	    inference('sup-', [status(thm)], ['14', '15'])).
0.00/0.21	tff(setadjoinIL, axiom,
0.00/0.21	  (setadjoinIL <=> (![Xx,Xy]: in(Xx,setadjoin(Xx,Xy))))).
0.00/0.21	tff('17', plain, ![X0, X1]: (in(X0, setadjoin(X0, X1)) | ~ setadjoinIL),
0.00/0.21	    inference('cnf', [status(esa)], [setadjoinIL])).
0.00/0.21	tff('18', plain, setadjoinIL, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('19', plain, ![X0, X1]: (in(X0, setadjoin(X0, X1)) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['17', '18'])).
0.00/0.21	tff('20', plain, ![X0, X1]: in(X0, setadjoin(X0, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['19'])).
0.00/0.21	tff('21', plain, (~ $true | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['16', '20'])).
0.00/0.21	tff('22', plain, $false, inference('simplify', [status(thm)], ['21'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
